Voting by Eliminating Quantifiers

Voting by Eliminating Quantifiers

Mathematical theory of voting and social choice has attracted much attention. In the general setting one can view social choice as a method of aggregating individual, often conflicting preferences and making a choice that is the best compromise. How preferences are expressed and what is the “best compromise” varies and heavily depends on a particular situation. The method we propose in this pap...

Eliminating Higher-Order Quantifiers to Obtain Decision Procedures for Hardware Verification

In this paper, we present methods for eliminating higher-order quantiiers in proof goals arising in the veriication of digital circuits. For the description of the circuits, a subset of higher-order logic called hardware formulae is used which is suucient for describing hardware speciications and implementations at register transfer level. Real circuits can be dealt with as well as abstract (ge...

Ranking units in DEA by using the voting system

Quantifiers ∗

Quantifiers are terms of generality. They are also among our prime examples of operators which take scope. The distinction between singular and general terms, as well as the ways that general terms enter into scope relations, are certainly fundamental to our understanding of language. Yet when we turn to natural language, we encounter a huge and apparently messy collection of general terms; not...

Reducing Latency by Eliminating Synchrony

Drawing or dragging an object on a mobile device is annoying today because the latency is manifested spatially with an obvious gap between the touch point and the line head or dragged object. This work identifies the multiple synchronization points in the input to display path of modern mobile systems as a major source of latency, contributing about 30ms to the overall latency. We present Prest...